TCP Congestion Control and Heavy Tails
نویسندگان
چکیده
Long-range dependence has been observed in many recent Internet traffic measurements. Previous studies have shown that there is a close relationship between heavy-tailed distribution of various traffic parameters and the long-range dependent property. In this paper, we use a simple Markov chain model to argue that when the loss rate is relatively high, TCP’s adaptive congestion control mechanism indeed generates traffic with heavy-tailed OFF, or idle, periods, and therefore introduces long-range dependence into the overall traffic. Moreover, the degree of such long-range dependence, measured by the Hurst parameter, increases as the loss rate increases, agreeing with many previous measurement-based studies. In addition, we observe that more variable initial retransmission timeout values for different packets introduces more variable packet inter-arrival times, which increases the burstiness of the overall traffic. Finally, we show that high loss conditions can lead to a heavy-tailed distribution of transmission times even for constant-sized files. This means that file size variability need not be the only cause of heavy-tailed variability in transmission durations. Keywords— Congestion Control, Long-Range Dependence, Self-Similarity.
منابع مشابه
The Chaotic Nature of TCP Congestion Control
In this paper we demonstrate how TCP congestion control can show chaotic behavior. We demonstrate the major features of chaotic systems in TCP/IP networks with examples. These features include unpredictability, extreme sensitivity to initial conditions and odd periodicity. Previous work has shown the fractal nature of aggregate TCP/IP traffic and one explanation to this phenomenon was that traf...
متن کاملImprovement of the mechanism of congestion avoidance in mobile networks
Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...
متن کاملOn rate limitation mechanisms for TCP throughput: A longitudinal analysis
TCP remains the dominant transport protocol for Internet traffic. It is usually considered to have its sending rate covered by a sliding window congestion control mechanism. However, in addition to this normal congestion control, a number of other mechanisms limit TCP throughput. This paper analyzes the extent to which network, host and application settings define flow throughput over time and ...
متن کاملTCP Westwood with Bulk Repeat for Heavy Loss Environments
Abstract — TCP Westwood (TCPW), a recently introduced sender only variant of TCP, was shown to be particularly efficient in high bandwidth, large propagation paths, with light random loss. That is, when the bandwidth delay product is high, and some of the links are exposed to wireless interference with relatively small loss rate (eg, satellite links or wireless last hops). In this paper, we foc...
متن کاملChannel quality based adaptation of TCP with loss discrimination
TCP responds to all losses by invoking congestion control and avoidance algorithms, resulting in degraded end-toend performance in lossy environments. In recent years, two approaches have been taken to improve the performance of TCP in such networks. One is local retransmission and the other is end-to-end control. These schemes either impose a heavy computational burden on base station, or cann...
متن کامل